Characterization of Glushkov automata
نویسندگان
چکیده
Glushkov algorithm computes a nondeterministic nite automaton without-transition and with n + 1 states from a simple regular expression having n occurrences of letters. The aim of this paper is to give a set of necessary and suucient conditions characterizing this automaton. Our characterization theorem is formulated in terms of directed graphs. Moreover these conditions allow us to produce an algorithm of conversion of a Glushkov automaton into a regular expression of small size.
منابع مشابه
Algorithms for Glushkov K-graphs
The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton algorithmic short cut [10]. The Glushkov graphs have been characterized [6] in terms of simple graph theoretical properties and certain reduction rules. We show how to...
متن کاملBlock-Deterministic Regular Languages
We introduce the notions of blocked, block-marked and block-deterministic regular expressions. We characterize block-deterministic regular expressions with determin-istic Glushkov block automata. The results can be viewed as a generalization of the characterization of one-unambiguous regular expressions with deterministic Glushkov automata. In addition, when a language L has a block-determinist...
متن کاملA Unified Construction of the Glushkov, Follow, and Antimirov Automata (TR2006-880)
Many techniques have been introduced in the last few decades to create -free automata representing regular expressions: Glushkov automata, the so-called follow automata, and Antimirov automata. This paper presents a simple and unified view of all these -free automata both in the case of unweighted and weighted regular expressions. It describes simple and general algorithms with running time com...
متن کاملAverage Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the expressions. A recent work shows that, under the uniform distribution, regular expressions lead to automata with a linear number of transitions. However, uniform regular expressions are not necessarily a satisfying mode...
متن کاملA Unified Construction of the Glushkov, Follow, and Antimirov Automata
A number of different techniques have been introduced in the last few decades to create -free automata representing regular expressions such as the Glushkov automata, follow automata, or Antimirov automata. This paper presents a simple and unified view of all these construction methods both for unweighted and weighted regular expressions. It describes simpler algorithms with time complexities a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 233 شماره
صفحات -
تاریخ انتشار 2000